Towards a General-Purpose Sequence Design System in DNA Computing

نویسندگان

  • Fumiaki Tanaka
  • Masashi Nakatsugawa
  • Masahito Yamamoto
  • Toshikazu Shiba
  • Azuma Ohuchi
چکیده

Sequence design has turned out to be a crucial factor in successful DNA computing. In this paper, we present a support system for sequence design in DNA computing. Our system can fit various requirements for sequence design. The β-version of this software is available for download.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault Tolerant DNA Computing Based on ‎Digital Microfluidic Biochips

   Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...

متن کامل

Image Encryption by Using Combination of DNA Sequence and Lattice Map

In recent years, the advancement of digital technology has led to an increase in data transmission on the Internet. Security of images is one of the biggest concern of many researchers. Therefore, numerous algorithms have been presented for image encryption. An efficient encryption algorithm should have high security and low search time along with high complexity.DNA encryption is one of the fa...

متن کامل

Towards a System for Simulating DNA Computing with Whiplash PCR

Whiplash PCR, a reaction in which hairpin DNA structures are extended by poly-merase, is a useful method for DNA computing. For example, state transitions can be implemented by this method. However, the feasibility of using whiplash PCR in a speciic DNA algorithm should be carefully considered. We have implemented a general-purpose simulator to aid those who design protocols and algorithms for ...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

A Mathematical Model for Cell Formation in CMS Using Sequence Data

Cell formation problem in Cellular Manufacturing System (CMS) design has derived the attention of researchers for more than three decades. However, use of sequence data for cell formation has been the least investigated area. Sequence data provides valuable information about the flow patterns of various jobs in a manufacturing system. This paper presents a new mathematical model to solve a cell...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002